Range searching on uncertain data

Range Searching in Categorical Data: Colored Range Searching on Grid

Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query as...

Range Queries on Uncertain Data

Given a set P of n uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures on P to answer range queries of the following three types for any query interval I : (1) top-1 query: find the point in P that lies in I with the highest probability, (2) top-k query: given any integer k ≤ n as part of th...

Range Searching Range Searching

Data Structures for Restricted Triangular Range Searching

We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear space and achieve polylogarithmic query times.

Compressed Data Structures for Range Searching

We study the orthogonal range searching problem on points that have a significant number of geometric repetitions, that is, subsets of points that are identical under translation. Such repetitions occur in scenarios such as image compression, GIS applications and in compactly representing sparse matrices and web graphs. Our contribution is twofold. First, we show how to compress geometric repet...